Analytical approach to Galerkin BEMs on polyhedral surfaces
نویسندگان
چکیده
منابع مشابه
Geodesic Flow on Polyhedral Surfaces
On a curved surface the front of a point wave evolves in concentric circles which start to overlap and branch after a certain time. This evolution is described by the geodesic ow and helps us to understand the geometry of surfaces. In this paper we compute the evolution of distance circles on polyhedral surfaces and develop a method to visualize the set of circles, their overlapping, branching,...
متن کاملGeodesic Spanners on Polyhedral Surfaces
In this paper we consider the problem of efficiently constructing geodesic t-spanners. We consider finding spanners on the surface of a 3 dimensional polyhedron. If Steiner vertices are allowed on the surface of the polyhedron, then we are able to construct sparse t-spanners. If no Steiner vertices are allowed, then we establish lower bounds on the maximum node degree, depending on the spanning...
متن کاملNumerical and Analytical Approach for Film Condensation on Different Forms of Surfaces
This paper tries to achieve a solution for problems that concern condensation around a flat plate, circular and elliptical tube in by numerical and analytical methods. Also, it calculates entropy production rates. At first, a problem was solved with mesh dynamic and rational assumptions; next it was compared with the numerical solution that the result had acceptable errors. An additional suppor...
متن کاملOn Vertex Offsets of Polyhedral Surfaces
Planar-faced mesh surfaces, also known as polyhedral surfaces, that possess vertex-offsets are useful in architectural design for constructing supporting structures, and also of interest in discrete differential geometry. We consider the existence and computation of vertex-offset meshes of general polyhedral surfaces and, specifically, study how the existence of vertex offsets is dictated by th...
متن کاملGeneralized Source Shortest Paths on Polyhedral Surfaces
We present an algorithm for computing shortest paths and distances from a single generalized source (point, segment, polygonal chain or polygon) to any query point on a possibly non-convex polyhedral surface. The algorithm also handles the case in which polygonal chain or polygon obstacles on the polyhedral surface are allowed. Moreover, it easily extends to the case of several generalized sour...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The SMAI journal of computational mathematics
سال: 2019
ISSN: 2426-8399
DOI: 10.5802/smai-jcm.50